Synchronized Shuue and Regular Languages Synchronized Shuue and Regular Languages
نویسندگان
چکیده
New representation results for three families of regular languages are stated, using a special kind of shuue operation, namely the synchronized shuue. First, it is proved that the family of regular star languages is the smallest family containing the language (a + bc) and closed under synchronized shuue and length preserving morphism. The second representation result states that the family of "-free regular languages is the smallest family containing the language (a + bc) d and closed under synchronized shuue, union and length preserving morphism. At last, it is proved that Reg is the smallest family containing the two languages (a+bb) and a+(ab) + , closed under synchronized shuue, union and length preserving morphism.
منابع مشابه
Shuue Languages Are in P
In this paper we show that shuue languages are contained in one-way-NSPACE(logn) thus in P. We consider the class of shuue languages which emerges from the class of nite languages through regular operations (union, concatenation, Kleene star) and shuue operations (shuue and shuue closure). For every shuue expression E we construct a shuue automaton which accepts the language generated by E and ...
متن کاملTight Lower Bound for the State Complexity of Shuffle of Regular Languages
The upper bound for the state complexity of the shuue of two regular languages is 2 mn ?1. We prove that this bound can be reached for some (not necessarily complete) deterministic nite automata with, respectively, m and n states. Our construction uses an alphabet of size 5.
متن کاملPAC Learning of Interleaved Melodies
A number of algebraic models of music that use the interleaving or shuue operator have been suggested in the literature. This paper shows how interleaving expressions are conducive to PAC identiication. PAC learning theory states that a \probably approximately correct" hypothesis that falls within a desired level of accuracy can be derived with a high probability from randomly selected training...
متن کاملPac Learning of Interleaved Melodies (revised)
A number of algebraic models of music that use the interleaving or shuue operator have been suggested in the literature. This paper shows how interleaving expressions are conducive to PAC identiication. PAC learning theory states that a \probably approximately correct" hypothesis that falls within a desired level of accuracy can be derived with a high probability from randomly selected training...
متن کاملSynchronized Shuffle and Regular Languages
New representation results for three families of regular languages are stated, using a special kind of shuffle operation, namely the synchronized shuffle. First, it is proved that the family of regular star languages is the smallest family containing the language (a+ bc)∗ and closed under synchronized shuffle and length preserving morphism. The second representation result states that the famil...
متن کامل